Keyword based Shuffling Algorithm for Question Paper Generator
نویسندگان
چکیده
منابع مشابه
Shuffling Algorithms for Automatic Generator Question Paper System
Examination process is important activities for educational institutions to evaluate student performance. Thus the quality of the exam questions would determine the quality of the students produced by the institutions. Preparing exam questions is challenges, tedious and time consuming for the instructors. Usually the instructors keeping their own test bank in some form to help them prepare futu...
متن کاملN -Gram vs. Keyword-Based Passage Retrieval for Question Answering
In this paper we describe the participation of the Universidad Politécnica of Valencia to the 2006 edition, which was focused on the comparison between a Passage Retrieval engine (JIRS) specifically aimed to the Question Answering task and a standard, general use search engine such as Lucene. JIRS is based on n-grams, Lucene on keywords. We participated in three monolingual tasks: Spanish, Ital...
متن کاملAdaptive Algorithm for Interactive Question-Based Search
Popular web search engines tend to improve the relevance of their result pages, but the search is still keyword–oriented and far from ”understanding” the queries’ meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users’ intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly...
متن کاملShuffling algorithm for boxed plane partitions
We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from a × b × c to (a − 1)× (b + 1)× c or (a + 1)× (b − 1)× c. Algorithmic realization of each step involves O((a+ b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions. ...
متن کاملOn the Shuffling Algorithm for Domino Tilings∗
We study the dynamics of a certain discrete model of interacting interlaced particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018916866